The Priority Ceiling Protocol: Formalization and Analysis Using PVS∗
نویسنده
چکیده
Common real-time operating systems rely on priority-based, preemptive scheduling. Resource sharing in such systems potentially leads to priority inversion: processes of high priority can be prevented from entering a critical section and be delayed by processes of lower priority. Since uncontrolled priority inversion can cause high-priority processes to miss their deadlines, a real-time operating system must use resource-sharing mechanisms that limit the effects of priority inversion. The priority ceiling protocol is one such mechanism. It ensures mutual exclusion and absence of deadlocks, and minimizes the length of priority inversion periods. This paper presents a formal specification and analysis of the protocol using PVS and the rigorous proof of associated schedulability results. Chapter
منابع مشابه
Real-Time Synchronization Protocols with Abortable Critical Sections
Making critical sections abortable is a promising approach to reducing priority inversions. To improve the schedulability of a system using abortable critical sections, the maximum number of abortions should be decreased. In this paper, we propose a real-time synchronization protocol named the ceiling abort protocol (CAP) which introduces a new priority-based abort scheme to the priority ceilin...
متن کاملA Priority Ceiling Protocol with Dynamic Adjustment of Serialization Order
The difficulties of providing a guarantee of meeting transaction deadlines in hard real-time database systems lie in the problems of priority inversion and of deadlocks. Priority inversion and deadlock problems ensue when concurrency control protocols are adapted in priority-driven scheduling. The blocking delay due to priority inversion can be unbounded, which is unacceptable in the mission-cr...
متن کاملUsing a PVS Embedding of CSP to Verify Authentication Protocols To be presented at TPHOLs Bell Labs Murray Hill New Jersey USA
This paper presents an application of PVS to the veri cation of security protocols The objective is to provide mechanical support for a veri cation method described in The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties We present an application to the Needham Schroeder public key protocol
متن کاملUsing a PVS Embedding of CSP to Verify Authentication Protocols
This paper presents an application of PVS to the veri cation of security protocols. The objective is to provide mechanical support for a veri cation method described in [14]. The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties. We present an application to the Needham-Schroeder public key pro...
متن کامل